Strong consistency ofk-parameters clustering
نویسندگان
چکیده
منابع مشابه
Strong Consistency of Prototype Based Clustering in Probabilistic Space
In this paper we formulate in general terms an approach to prove strong consistency of the Empirical Risk Minimisation inductive principle applied to the prototype or distance based clustering. This approach was motivated by the Divisive Information-Theoretic Feature Clustering model in probabilistic space with Kullback-Leibler divergence which may be regarded as a special case within the Clust...
متن کاملStrong consistency of the prototype based clustering in probabilistic space
In this paper we formulate in general terms an approach to prove strong consistency of the Empirical Risk Minimisation inductive principle applied to the prototype or distance based clustering. This approach was motivated by the Divisive Information-Theoretic Feature Clustering model in probabilistic space with Kullback-Leibler divergence, which may be regarded as a special case within the Clus...
متن کاملStrong Consistency at Scale
Today’s online services must meet strict availability and performance requirements. State machine replication, one of the most fundamental approaches to increasing the availability of services without sacrificing strong consistency, provides configurable availability but limited performance scalability. Scalable State Machine Replication (S-SMR) achieves scalable performance by partitioning the...
متن کاملThe Statistical Mechanics ofk
The satissability of random CNF formulae with precisely k variables per clause (\k-SAT") is a popular testbed for the performance of search algorithms. Formulae have M clauses from N variables, randomly negated, keeping the ratio = M=N xed. For k = 2, this model has been proven to have a sharp threshold at = 1 between formulae which are almost aways satissable and formulae which are almost neve...
متن کاملConsistency of Spectral Clustering
Consistency is a key property of all statistical procedures analyzing randomly sampled data. Surprisingly, despite decades of work, little is known about consistency of most clustering algorithms. In this paper we investigate consistency of the popular family of spectral clustering algorithms, which clusters the data with the help of eigenvectors of graph Laplacian matrices. We develop new meth...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Multivariate Analysis
سال: 2013
ISSN: 0047-259X
DOI: 10.1016/j.jmva.2013.01.013